On Some Compositional Petri
نویسندگان
چکیده
This paper continues a research on universal contexts and Petri net semantics started in NPS95]. We regard generalized, labelled Petri nets, N, where some transitions and places are distinguished as`public'. They form the interface of N that may communicate with a Petri net context. An elementary calculus, E, is introduced that allows to construct any Petri net with an interface from trivial constants (single places, single transitions) by drawing arcs, adding tokens, and hiding public places and transitions. We prove the existence of a universal context U such that two Petri nets behave the same in any context ii their behaviour is equal in the universal context. Let B(UN]) be the behaviour of N embedded in its universal context, where B may be the interleaving language, step{language, or true{concurrent pomset{language. In any of these cases, B(UN]) (in contrast to B(N)) turns out to be a fully{abstract semantics of N with respect to the algebra E.
منابع مشابه
Reachability via Compositionality in Petri nets
We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising experimental results on some well-known examples.
متن کاملExtending Propositional Dynamic Logic for Petri Nets
Lopes, Bruno; Haeusler, Edward Hermann (advisor); Dowek, Gilles (coadvisor). Extending Propositional Dynamic Logic for Petri Nets. Rio de Janeiro, 2014. 101p. D.Sc. Thesis — Departamento de Informática, Pontif́ıcia Universidade Católica do Rio de Janeiro. Propositional Dynamic Logic (PDL) is a multi-modal logic used for specifying and reasoning on sequential programs. Petri Net is a widely used ...
متن کاملOn Compositionality of Boundedness and Liveness for Nested Petri Nets
Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...
متن کاملCompositional analysis for regularity, liveness and boundedness
By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be pre...
متن کاملAn Improved Translation of SA/RT Speci cation Model to High-Level Timed Petri Nets
Structured analysis methods for real-time systems (SA/RT) are widely accepted by the industrial world as a mature approach to real-time systems design. These methods use highly expressive graphical speci cation languages to specify system requirements. Giving semantics to SA/RT speci cations via selected formal models has the advantage of not only retaining their user-friendly and problem-orien...
متن کاملAn Improved Translation of SA/RT Specification Model to High-Level Timed Petri Nets
Structured analysis methods for real-time systems (SA/RT) are widely accepted by the industrial world as a mature approach to real-time systems design. These methods use highly expressive graphical speciication languages to specify system requirements. Giving semantics to SA/RT speciications via selected formal models has the advantage of not only retaining their user-friendly and problem-orien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995